Learning DNFs and Circuits Using Teaching Assistants
نویسنده
چکیده
In this paper we consider the complexity of learning monotone DNF formulae and Boolean circuits in an exact learning model called the teaching assistant model. This model, introduced in one of our earlier works, uses teaching assistant classes for classifying learning problems. Teaching assistant classes are a learning-theoretic analog of complexity classes. We show that monotone DNFs are learnable using a teaching assistant in the class SPP. On the other hand, Boolean circuits and general DNFs are not learnable using an SPP teaching assistant unless NP ⊆ SPP. We also show that learnability of Boolean circuits with an assistant in the class NP will improve the Karp-Lipton collapse result to P.
منابع مشابه
Inquiry-based training improves teaching effectiveness of biology teaching assistants
Graduate teaching assistants (GTAs) are used extensively as undergraduate science lab instructors at universities, yet they often have having minimal instructional training and little is known about effective training methods. This blind randomized control trial study assessed the impact of two training regimens on GTA teaching effectiveness. GTAs teaching undergraduate biology labs (n = 52) co...
متن کاملEffect of learning styles on postgraduate students and clinical assistants (a case study in Mazandaran University of Medical Sciences)
Introduction: The main purpose of this research study was to investigate the effect of learning styles on academic self-efficacy of postgraduate students and clinical assistants in Mazandaran University of medical science. Methods: In this descriptive-survey study, the statistical population included 570 postgraduate students and clinical assistants in Mazandaran University of medical science i...
متن کاملOn Learning Thresholds of Parities and Unions of Rectangles in Random Walk Models
In a recent breakthrough, [Bshouty et al., 2005] obtained the first passivelearning algorithm for DNFs under the uniform distribution. They showed that DNFs are learnable in the Random Walk and Noise Sensitivity models. We extend their results in several directions. We first show that thresholds of parities, a natural class encompassing DNFs, cannot be learned efficiently in the Noise Sensitivi...
متن کاملThe Complexity of Exactly Learning
In this paper, we investigate the complexity of exact-learning classes of permutation groups and linear spaces over nite elds. These concept classes can be seen as special subclasses of the concept class of circuits. It turns out that in Angluin's exact-learning model these concept classes are learnable with equivalence queries but not learnable with membership queries, indeed not even exact le...
متن کاملDesign and Evaluation of a Web-based Virtual Open Laboratory Teaching Assistant (VOLTA) for Circuits Laboratory
A Virtual Open Laboratory Teaching Assistant (VOLTA) provides personalized instruction for students participating in a self-paced undergraduate circuits laboratory. VOLTA allows students to work in the open laboratory even when a teaching assistant is unavailable. The system’s components include pre-lab testing and instruction, engineering design exercises, short topic explanation videos, instr...
متن کامل